The Number of Cycles of Specified Normalized Length in Permutations

نویسنده

  • MICHAEL LUGO
چکیده

We compute the limiting distribution, as n → ∞, of the number of cycles of length between γn and δn in a permutation of [n] chosen uniformly at random, for constants γ, δ such that 1/(k + 1) ≤ γ < δ ≤ 1/k for some integer k. This distribution is supported on {0, 1, . . . , k} and has 0th, 1st, ..., kth moments equal to those of a Poisson distribution with parameter log δ γ . For more general choices of γ, δ we show that such a limiting distribution exists, which can be given explicitly in terms of certain integrals over intersections of hypercubes with half-spaces; these integrals are analytically intractable but a recurrence specifying them can be given. The results herein provide a basis of comparison for similar statistics on restricted classes of permutations. The distribution of the number of k-cycles in a permutation of [n], for a fixed k, converges to a Poisson distribution with mean 1/k as k → ∞. In particular the mean number of k-cycles and the variance of the number of k-cycles are both 1/k whenever n ≥ k and n ≥ 2k respectively. If instead of holding k constant we let it vary with n, the number of αn-cycles in permutations of [n] approaches zero as n→∞ with α fixed. So to investigate the number of cycles of long lengths, we must rescale and look at many cycle lengths at once. In particular, we consider the number of cycles with length in some interval [γn, δn] as n → ∞. The expectation of the number of cycles with length in this interval is ∑δn k=γn 1/k, which approaches the constant log δ/γ as n grows large. By analogy with the fixed-k case we might expect the number of cycles with length in this interval to be Poisson-distributed. But this cannot be the case, because there is room for at most 1/γ cycles of length at least γn, and the Poisson distribution can take arbitrarily large values. In the case where 1/γ and 1/δ lie in the same interval [1/(k + 1), 1/k] for some integer k, the limit distribution has the same first k moments as Poisson(log δ/γ). For general γ and δ the situation is considerably more complex but a limit distribution still exists. Date: September 15, 2009. 2000 Mathematics Subject Classification. 05A16, 60C05. 1 ar X iv :0 90 9. 29 09 v1 [ m at h. C O ] 1 6 Se p 20 09

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

3 1 Ju l 2 00 6 Permutations , cycles , and the pattern 2 – 13

We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.

متن کامل

Permutations, Cycles and the Pattern 2-13

We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.

متن کامل

Local Probabilities for Random Permutations Without Long Cycles

We explore the probability ν(n, r) that a permutation sampled from the symmetric group of order n! uniformly at random has no cycles of length exceeding r, where 1 6 r 6 n and n → ∞. Asymptotic formulas valid in specified regions for the ratio n/r are obtained using the saddle-point method combined with ideas originated in analytic number theory.

متن کامل

Cycle-up-down permutations

A permutation is defined to be cycle-up-down if it is a product of cycles that, when written starting with their smallest element, have an up-down pattern. We prove bijectively and analytically that these permutations are enumerated by the Euler numbers, and we study the distribution of some statistics on them, as well as on up-down permutations and on all permutations. The statistics include t...

متن کامل

Cycles of Free Words in Several Independent Random Permutations

In this text, extending results of [Ni94] and [Ne05], we study the asymptotics of the number of cycles of a given length of a word in several independent random permutations with restricted cycle lengths. Specifically, for A1,. . . , Ak non empty sets of positive integers and for w word in the letters g1, g −1 1 , . . . , gk, g −1 k , we consider, for all n such that it is possible, an independ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009